Normal forms of random braids
نویسندگان
چکیده
منابع مشابه
Alternating Normal Forms for Braids and Locally Garside Monoids
We describe new types of normal forms for braid monoids, Artin– Tits monoids, and, more generally, all monoids in which divisibility has some convenient lattice properties (“locally Garside monoids”). We show that, in the case of braids, one of these normal forms turns out to coincide with the normal form introduced by Burckel and deduce that the latter can be computed easily. This approach lea...
متن کاملGenerating random braids
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the mi...
متن کاملA Normal Form for Braids
We present a seemingly new normal form for braids, where every braid is expressed using a word in a regular language on some simple alphabet of elementary braids. This normal form stems from analysing the geometric action of braid groups on curves in a punctured disk.
متن کاملCombinatorics of normal sequences of braids
Many natural counting problems arise in connection with the normal form of braids—and seem to have not been much considered so far. Here we solve some of them. One of the noteworthy points is that a number of different induction schemes appear. The key technical ingredient is an analysis of the normality condition in terms of permutations and their descents, in the vein of the Solomon algebra. ...
متن کاملFast Computation of Hermite Normal Forms of Random Integer Matrices
This paper is about how to compute the Hermite normal form of a random integer matrix in practice. We propose significant improvements to the algorithm by Micciancio and Warinschi, and extend these techniques to the computation of the saturation of a matrix. Tables of timings confirm the efficiency of this approach. To our knowledge, our implementation is the fastest implementation for computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2014
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2013.10.008